An Effective Implementation of K-opt Moves for the Lin-Kernighan TSP Heuristic
نویسنده
چکیده
Local search with k-change neighborhoods, k-opt, is the most widely used heuristic method for the traveling salesman problem (TSP). This report presents an effective implementation of k-opt for the LinKernighan TSP heuristic. The effectiveness of the implementation is demonstrated with extensive experiments on instances ranging from 10,000 to 10,000,000 cities.
منابع مشابه
General k-opt submoves for the Lin-Kernighan TSP heuristic
Local search with k-exchange neighborhoods, k-opt, is the most widely used heuristic method for the traveling salesman problem (TSP). This paper presents an effective implementation of k-opt in LKH-2, a variant of the Lin–Kernighan TSP heuristic. The effectiveness of the implementation is demonstrated with experiments on Euclidean instances ranging from 10,000 to 10,000,000 cities. The runtime ...
متن کاملContinuous Relaxations for the Traveling Salesman Problem
In this work, we construct heuristic approaches for the traveling salesman problem (TSP) based on embedding the discrete optimization problem into continuous spaces. We explore multiple embedding techniques – namely, the construction of dynamical flows on the manifold of orthogonal matrices and associated Procrustes approximations of the TSP cost function. In particular, we find that the Procru...
متن کاملAn Effective Heuristic Algorithm for the Traveling-Salesman Problem
An Eflective Heuristic Algorithm for the Traveling. THE SYMMETRIC traveling-salesman problem is: Given an n by n symmetric matrix of.symmetric traveling salesman problem. However, the design and implementation of an algorithm based on this heuristic is not trivial. There are many.This article is about the heuristic for the travelling salesman problem. An Effective Heuristic Algorithm for the Tr...
متن کاملA Parallel Hybrid Heuristic for the TSP
In this paper we investigate the design of a coarse-grained parallel implementation of Cga-LK, a hybrid heuristic for the Traveling Salesman Problem (TSP). Cga-LK exploits a compact genetic algorithm in order to generate high-quality tours which are then refined by means of an efficient implementation of the Lin-Kernighan local search heuristic. The results of several experiments conducted on a...
متن کاملAn eective implementation of the Lin±Kernighan traveling salesman heuristic
This paper describes an implementation of the Lin±Kernighan heuristic, one of the most successful methods for generating optimal or near-optimal solutions for the symmetric traveling salesman problem (TSP). Computational tests show that the implementation is highly eective. It has found optimal solutions for all solved problem instances we have been able to obtain, including a 13,509-city prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006